// Created by WXX on 2021/10/10 16:55
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

/**
 * 执行用时：68 ms, 在所有 C++ 提交中击败了53.91%的用户
 * 内存消耗：31.4 MB, 在所有 C++ 提交中击败了78.55%的用户
 */
class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        sort(arr.begin(), arr.end());
        int d = INT_MAX;
        for (int i = 1; i < arr.size(); i++)
            d = min(d, arr[i] - arr[i - 1]);
        vector<vector<int>> res;
        for (int i = 1; i < arr.size(); i++)
            if (arr[i] - arr[i - 1] == d)
                res.push_back({arr[i - 1], arr[i]});
        return res;
    }
};

int main() {


    return 0;
}
